About Half Permutations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

About Half Permutations

In 2011, Beaton et al. analytically proved that the number of directed columnconvex permutominoes of size n is given by (n+ 1)!/2. In this paper, we provide a different proof of this statement using a bijective method. More precisely, we present a bijective correspondence between the class Dn of directed column-convex permutominoes of size n and a set of permutations (called dcc-permutations) o...

متن کامل

Learning about Spin-One-Half Fields

It is hard to understand spin-one-half fields without reading Weinberg. This paper is a pedagogical footnote to his formalism with an emphasis on the boost matrix, spinors, and Majorana fields. Learning about Spin-One-Half Fields 2

متن کامل

HypExp 2, expanding hypergeometric functions about half-integer parameters

In this article, we describe a new algorithm for the expansion of hypergeometric functions about half-integer parameters. The implementation of this algorithm for certain classes of hypergeometric functions in the already existing Mathematica package HypExp is described. Examples of applications in Feynman diagrams with up to four loops are given. PACS:02.10.De, 02.30.Gp

متن کامل

A Stream Cipher Based on Chaotic Permutations

In this paper we introduce a word-based stream cipher consisting of a chaotic part operating as a chaotic permutation and a linear part, both of which designed on a finite field. We will show that this system can operate in both synchronized and self-synchronized modes. More specifically, we show that in the self-synchronized mode the stream cipher has a receiver operating as an unknown input o...

متن کامل

Intersecting families of permutations and partial permutations

The above result motivated the study of intersecting families of permutations which was initiated by Deza and Frankl, see [2]. Let Sn be the symmetric group on [n], that is the group of all permutations of [n]. For a positive integer t, a subset A of Sn is said to be t-intersecting if, for any g, h ∈ A with g 6= h, we have |{x : g(x) = h(x)}| ≥ t. By an intersecting family, we mean an 1-interse...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Electronic Journal of Combinatorics

سال: 2014

ISSN: 1077-8926

DOI: 10.37236/3490